Every 4-regular graph plus an edge contains a 3-regular subgraph
نویسندگان
چکیده
منابع مشابه
Every 4-regular graph is acyclically edge-6-colorable
An acyclic edge coloring of a graph G is a proper edge coloring such that no bichromatic cycles are produced. The acyclic chromatic index a(G) of G is the smallest integer k such that G has an acyclic edge coloring using k colors. Fiamčik (1978) and later Alon, Sudakov and Zaks (2001) conjectured that a(G) ≤ ∆ + 2 for any simple graph G with maximum degree ∆. Basavaraju and Chandran (2009) show...
متن کاملEdge Regular Graph Products
A regular nonempty graph Γ is called edge regular, whenever there exists a nonegative integer λΓ, such that any two adjacent vertices of Γ have precisely λΓ common neighbours. An edge regular graph Γ with at least one pair of vertices at distance 2 is called amply regular, whenever there exists a nonegative integer μΓ, such that any two vertices at distance 2 have precisely μΓ common neighbours...
متن کاملEvery DFS Tree of a 3-Connected Graph Contains a Contractible Edge
Let G be a 3-connected graph on more than 4 vertices. We show that every depth-first-search tree of G contains a contractible edge. Moreover, we show that if G is 3-regular or does not have two disjoint pairs of adjacent degree-3 vertices, every spanning tree of G contains a contractible edge.
متن کاملEvery line graph of a 4 - edge - connected graph is Z 3 - connected
In [Discrete Math. 230 (2001), 133-141], it is shown that Tutte’s 3-flow conjecture that every 4-edge-connected graph has a nowhere zero 3-flow is equivalent to that every 4-edge-connected line graph has a nowhere zero 3-flow. We prove that every line graph of a 4-edgeconnected graph is Z3-connected. In particular, every line graph of a 4-edge-connected graph has a nowhere zero 3-flow.
متن کاملEvery Graph of Sufficiently Large Average Degree Contains a C4-Free Subgraph of Large Average Degree
We prove that for every k there exists d = d(k) such that every graph of average degree at least d contains a subgraph of average degree at least k and girth at least six. This settles a special case of a conjecture of Thomassen.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 1984
ISSN: 0095-8956
DOI: 10.1016/0095-8956(84)90048-0